A Quasi-Isometric Embedding Algorithm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quasi-isometric Embedding Algorithm

The Whitney embedding theorem gives an upper bound on the smallest embedding dimension of a manifold. If a data set lies on a manifold, a random projection into this reduced dimension will retain the manifold structure. Here we present an algorithm to find a projection that distorts the data as little as possible.

متن کامل

Topologically Constrained Isometric Embedding

— We present a new algorithm for nonlinear dimensionality reduction that consistently uses global information, which enables understanding the intrinsic geometry of non-convex manifolds. Compared to methods that consider only local information, our method appears to be more robust to noise. We demonstrate the performance of our algorithm and compare it to state-of-the-art methods on synthetic a...

متن کامل

Isometric Embedding and Continuum ISOMAP

Recently, the Isomap algorithm has been proposed for learning a nonlinear manifold from a set of unorganized high-dimensional data points. It is based on extending the classical multidimensional scaling method for dimension reduction. In this paper, we present a continuous version of Isomap which we call continuum isomap and show that manifold learning in the continuous framework is reduced to ...

متن کامل

Affine Isometric Embedding for Surfaces

A strictly convex hypersurface in Rn can be endowed with a Riemannian metric in a way that is invariant under the group of (equi)affine motions. We study the corresponding isometric embedding problem for surfaces in R3. This problem is formulated in terms of a quasilinear elliptic system of PDE for the Pick form. A negative result is obtained by attempting to invert about the standard embedding...

متن کامل

Embedding graphs as isometric medians

We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition and Image Analysis

سال: 2019

ISSN: 1054-6618,1555-6212

DOI: 10.1134/s105466181902007x